A lower bound for the Chung-Diaconis-Graham random process
نویسندگان
چکیده
منابع مشابه
A lower bound for the Chung-Diaconis-Graham random process
Chung, Diaconis, and Graham considered random processes of the form Xn+1 = anXn + bn (mod p) where p is odd, X0 = 0, an = 2 always, and bn are i.i.d. for n = 0, 1, 2, . . .. In this paper, we show that if P (bn = −1) = P (bn = 0) = P (bn = 1) = 1/3, then there exists a constant c > 1 such that c log2 p steps are not enough to make Xn get close to uniformly distributed on the integers mod p.
متن کاملOn the Chung-diaconis-graham Random Pro- Cess
Abstract Chung, Diaconis, and Graham considered random processes of the form Xn+1 = 2Xn + bn (mod p) where X0 = 0, p is odd, and bn for n = 0, 1, 2, . . . are i.i.d. random variables on {−1, 0, 1}. If Pr(bn = −1) = Pr(bn = 1) = β and Pr(bn = 0) = 1− 2β, they asked which value of β makes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results...
متن کاملOn a Question of Chung, Diaconis, and Graham
Chung, Diaconis, and Graham considered random processes of the form Xn+1 = 2Xn + bn (mod p) where X0 = 0, p is odd, and bn for n = 0, 1, 2, . . . are i.i.d. random variables on {−1, 0, 1}. If Pr(bn = −1) = Pr(bn = 1) = β and Pr(bn = 0) = 1 − 2β, they asked which value of β makes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results of Chun...
متن کاملChung Graham scribe : Chris Calabro
Sometimes the edge set of an undirected graph is defined as a collection of doubleton subsets of the vertex set V . To unify the discussion, we will adopt the convention that the edge set E of a digraph G is a subset of V 2 and that G is undirected iff ∀i, j ∈ V ((i, j) ∈ E ↔ (j, i) ∈ E). Let G = (V,E) be a digraph with V = [n] = {1, . . . , n}. We can associate with G its adjacency matrix adj(...
متن کاملA Tight Lower Bound on the Cover Time for Random
We prove that the expected time for a random walk to cover all n vertices of a graph is at least (1 + o(1))n lnn.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2008
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-08-09687-1